منابع مشابه
Approximation of endpoints for multi-valued mappings in metric spaces
In this paper, under some appropriate conditions, we prove some $Delta$ and strong convergence theorems of endpoints for multi-valued nonexpansive mappings using modified Agarwal-O'Regan-Sahu iterative process in the general setting of 2-uniformly convex hyperbolic spaces. Our results extend and unify some recent results of the current literature.
متن کاملBest Approximation in Metric Spaces
A metric space (X, d) is called an M-space if for every x and y in X and for every r 6 [0, A] we have B[x, r] Cl B[y, A — r] = {2} for some z € X, where A = d(x, y). It is the object of this paper to study M-spaces in terms of proximinality properties of certain sets. 0. Introduction. Let (X, d) be a metric space, and G be a closed subset of X. For x E X, let p(x,G) = inf{d(x, y) : y E G}. If t...
متن کاملGromov-Hausdorff Approximation of Metric Spaces with Linear Structure
In many real-world applications data come as discrete metric spaces sampled around 1-dimensional filamentary structures that can be seen as metric graphs. In this paper we address the metric reconstruction problem of such filamentary structures from data sampled around them. We prove that they can be approximated, with respect to the Gromov-Hausdorff distance by well-chosen Reeb graphs (and som...
متن کاملApproximation of Metric Spaces by Partial Metric Spaces
Partial metrics are generalised metrics with non-zero self-distances. We slightly generalise Matthews' original definition of partial metrics, yielding a notion of weak partial metric. After considering weak partial metric spaces in general, we introduce a weak partial metric on the poset of formal balls of a metric space. This weak partial metric can be used to construct the completion of clas...
متن کاملApproximation Algorithms for Bounded Dimensional Metric Spaces
The study of finite metrics is an important area of research, because of its wide applications to many different problems. The input of many problems (for instance clustering, near-neighbor queries and network routing) naturally involves a set of points on which a distance function has been defined. Hence, one would be motivated to store and process metrics in an efficient manner. The central i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Banach Center Publications
سال: 1979
ISSN: 0137-6934,1730-6299
DOI: 10.4064/-4-1-7-18